package algorithm.leetcode.I1to100;

public class Q1 {
    public int[] twoSum(int[] nums, int target) {

        int[] ints = new int[2];

        for (int i = 0; i < nums.length; i++) {
            for (int j = 0; j < i; j++) {
                if (target == nums[i] + nums[j]) {
                    ints[0] = i;
                    ints[1] = j;
                }
            }
        }
        return ints;

    }



}
